On the algebraic structure of polycyclic codes

In this paper, we are interested in the study of right polycyclic codes as invariant subspaces Fnq by a fixed operator TR. This approach has helped one hand to connect them ideals polynomials ring Fq [x]/?f)X)?, where f (x) is minimal polynomial On other hand, it allows prove that dual code adjoint Hence, when TR normal also code. However, isn?t equivalent Finally, cyclic case, BCH-like and Hartmann-Tzeng-like bounds for on Hamming distance derived.